COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
نویسندگان
چکیده
منابع مشابه
Computable Structures in Generic Extensions
In this paper, we investigate connections between structures present in every generic extension of the universe V and computability theory. We introduce the notion of generic Muchnik reducibility that can be used to to compare the complexity of uncountable structures; we establish basic properties of this reducibility, and study it in the context of generic presentability, the existence of a co...
متن کاملLocally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finitely generated substructures of S effectively. Our discussion emphasizes definitions and examples, but does prove two significant results. First, our notion of mextensional local computability of S ensures that the Σn-t...
متن کاملRelations on computable structures
Gődel’s incompleteness theorem from 1931 is an astonishing early result of computable mathematics. Gődel showed that “there are in fact relatively simple problems in the theory of ordinary whole numbers which cannot be decided from the axioms.” The work of Gődel, Turing, Kleene, Church, Post and others in the mid-1930’s established the rigorous mathematical foundations for the computability the...
متن کاملEmbeddings of Computable Structures
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fixing and varying the computable presentations of the computable structures.
متن کاملComputable Structures: Presentations Matter
The computability properties of a relation R not included in the language of a computable structure A can vary from one computable presentation to another. We describe some classic results giving conditions onA orR that restrict the possible variations in the computable dimension of A (i.e. the number of isomorphic copies of A up to computable isomorphism) and the computational complexity ofR. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2016
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2015.30